Maximizing total job value on a single machine with job selection
نویسندگان
چکیده
منابع مشابه
Single machine scheduling with interfering job sets
We consider two single machine bicriteria scheduling problems in which jobs belong to either of two different disjoint sets, each set having its own performance measure. The problem has been referred to as interfering job sets in the scheduling literature and also been called multi-agent scheduling where each agent’s objective function is to be minimized. In the first problem (P1) we look at mi...
متن کاملMinimizing total weighted tardiness on a single batch process machine with incompatible job families
The di0usion step in semiconductor wafer fabrication is very time consuming, compared to other steps in the process, and performance in this area has a signi1cant impact on overall factory performance. Di0usion furnaces are able to process multiple lots of similar wafers at a time, and are therefore appropriately modeled as batch processing machines with incompatible job families. Due to the im...
متن کاملScheduling on a Single Machine to Minimize Total Flow Time with Job Rejections
We consider the problem of minimizing flow time on a single machine supporting preemption that can reject jobs at a cost. Even if all jobs have the same rejection cost, we show that no online algorithm can have competitive ratio better than (2+ √ 2)/2 ≈ 1.707 in general or e/(e− 1) ≈ 1.582 if all jobs are known to have the same processing time. We also give an optimal offline algorithm for unit...
متن کاملMaximizing Job Completions Online
We consider the problem of maximizing the number of jobs completed by their deadline in an online single processor system where the jobs are preemptable and have release times. So in the standard three eld scheduling notation, this is the online version of the problem 1 j r i ; pmtn j P (1 ? U i). We present a deterministic algorithm Lax, and show that for every instance I, it is the case that ...
متن کاملSingle Machine Scheduling with Job-Dependent Machine Deterioration
We consider the single machine scheduling problem with job-dependent machine deterioration. In the problem, we are given a single machine with an initial non-negative maintenance level, and a set of jobs each with a non-preemptive processing time and a machine deterioration. Such a machine deterioration quantifies the decrement in the machine maintenance level after processing the job. To avoid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2017
ISSN: 0160-5682,1476-9360
DOI: 10.1057/s41274-017-0238-z